optimal resource allocation in dea with integer variables
Authors
abstract
resource allocation and optimal leveling are among the top challenges in project management. this paper presents a dea-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. to achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all dmus. such as some of them can only take integer values. so, after this design for the value of inputs and outputs all dmus are placed on the optimal level. an illustrative example is used to show the applicability of the proposed method.
similar resources
OPTIMAL RESOURCE ALLOCATION IN DEA WITH INTEGER VARIABLES
Resource allocation and optimal leveling are among the top challenges in project management. This paper presents a DEA-based procedure for determining an optimal level of inputs to produce a fixed level of outputs. To achieve this goal, we assume that the levels of outputs can be forecasted in the next season and the procedure will determine optimal level of inputs for all DMUs. Such as some of...
full textA Bi-level Formulation for Centralized Resource Allocation DEA Models
In this paper, the common centralized DEA models are extended to the bi-level centralized resource allocation (CRA) models based on revenue efficiency. Based on the Karush–Kuhn–Tucker (KKT) conditions, the bi-level CRA model is reduced to a one-level mathematical program subject to complementarity constraints (MPCC). A recurrent neural network is developed for solving this one-level mathematica...
full textOptimal Resource Allocation with Semi-Bandit Feedback
We study a sequential resource allocation problem involving a fixed number of recurring jobs. At each time-step the manager should distribute available resources among the jobs in order to maximise the expected number of completed jobs. Allocating more resources to a given job increases the probability that it completes, but with a cut-off. Specifically, we assume a linear model where the proba...
full textSolving Resource Allocation/Scheduling Problems with Constraint Integer Programming
Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of CP to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that r...
full textFixed cost and resource allocation based on DEA cross-efficiency
In many managerial applications, situations frequently occur when a fixed cost is used in constructing the common platform of an organization, and needs to be shared by all related entities, or decision making units (DMUs). It is of vital importance to allocate such a cost across DMUs where there is competition for resources. Data envelopment analysis (DEA) has been successfully used in cost an...
full textCategorical Variables in Dea
If a DEA model has a mix of categorical and continuous variables a standard LP formulation can still be used by entering all combinations of categorical and continuous variables as different types of inputs and/or outputs. Most units will then not have positive levels of all variables. The implications for selection of peers are investigated. Peers can have the same or fewer types of inputs tha...
full textMy Resources
Save resource for easier access later
Journal title:
international journal of mathematical modelling and computationsجلد ۱، شماره ۴ (FALL)، صفحات ۲۵۱-۲۵۶
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023